Computing and Dominating the Ryll-nardzewski Function
نویسنده
چکیده
We study, for a countably categorical theory T, the complexity of computing and the complexity of dominating the function specifying the number of n-types consistent with T.
منابع مشابه
On the Cohomology of Weakly Almost Periodic Group Representations
We initiate a study of cohomological aspects of weakly almost periodic group representations on Banach spaces, in particular, isometric representations on reflexive Banach spaces. Using the Ryll-Nardzewski fixed point Theorem, we prove a vanishing result for the restriction map (with respect to a subgroup) in the reduced cohomology of weakly periodic representations. Combined with the Alaoglu-B...
متن کاملA Geometric Proof of Ryll-nardzewski's Fixed Point Theorem by I. Namioka and E. Asplund
In [4], Ryll-Nardzewski gave what he called an 'old-fashioned' proof of his famous fixed point theorem. The purpose of the present note is to give an even more old-fashioned proof of the fixed point theorem. In fact, our proof uses nothing more than a category argument and the classical Krein-Milman theorem. Our terminology and notation shall be those of Kelley, Namioka et al. [2]. The followin...
متن کاملThe Zarankiewicz Problem via Chow Forms
The well-known Zarankiewicz problem [Za] is to determine the least positive integer Z(m,n, r, s) such that each m × n 0-1 matrix containing Z(m,n, r, s) ones has an r × s submatrix consisting entirely of ones. In graph-theoretic language, this is equivalent to finding the least positive integer Z(m, n, r, s) such that each bipartite graph on m black vertices and n white vertices with Z(m,n, r, ...
متن کاملOn Secondary Processes Generated by a Random Point Distribution of Poisson Type
In the present paper we consider the mathematical model of secondary processes and give a general and rigorous method for solving special problems. We do not suppose that the basic “process” is a time-process but consider the problem more generally, i.e. we replace the time axis by an abstract space where the random points are distributed. The idea of our general method was suggested by a lectu...
متن کاملOn the Uniqueness of Individual Demand at Almost Every Price System
The fact that even in case of a nonconvex preference relation the demand set is a singleton at almost every budget situation has been proved by Mas-Cole11 [2] and by Mas-Cole11 and Neuefeind [3]. Mas-Colell’s proof made use of the theory of Hausdorff measures on lower dimensional subspaces of a Euclidian space. The proof due to Mas-Cole11 and Neuefeind relies on an application of the projection...
متن کامل